Department of Computer Science , University of Otago Technical Report OUCS - 2006 - 04 Monotonic Sequence
نویسندگان
چکیده
In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascending subsequence of length a or a descending one of length d. We investigate the behaviour of this game when played on finite linear orders or Q and provide some general observations for play on arbitrary ordered sets.
منابع مشابه
University of Otago Technical Report OUCS - 2006 - 09 Permutations Containing Many Patterns
It is shown that the maximum number of patterns that can occur in a permutation of length n is asymptotically 2. This significantly improves a previous result of Coleman.
متن کاملUniversity of Otago Technical Report OUCS - 2010 - 04 View - Oriented Transactional Memory
—This paper proposes a View-Oriented Transac-tional Memory (VOTM) model to seamlessly integrate different concurrency control methods including locking mechanism and transactional memory. The model allows programmers to partition the shared memory into " views " which are non-overlapping sets of shared data objects. A Restricted Admission Control (RAC) scheme is proposed to control the number o...
متن کاملConsistency in a Partitioned Network: A Survey
Recently, several strategies for transaction processing in partitioned distributed database systems with replicated data have been proposed. We survey these strategies in light of the competing goals of maintaining correctness and achieving high availability. Extensions and combinations are then discussed, and guidelines for the selection of a strategy for a particular application are presented...
متن کاملA Formal Analysis of Some Properties of Kerberos 5 Using MSR
We give three formalizations of the Kerberos 5 authentication protocol in the Multi-Set Rewriting (MSR)formalism. One is a high-level formalization containing just enough detail to prove authentication andconfidentiality properties of the protocol. A second formalization refines this by adding a variety of protocoloptions; we similarly refine proofs of properties in the first fo...
متن کاملResearch on Symbolic Inference in Computational Vision
This paper provides an overview of ongoing research in the GRASP laboratory which focuses on the general problem of symbolic inference in computational vision. In this report we describe a conceptual framework for this research, and describe our current research programs in the component areas which support this work. Comments University of Pennsylvania Department of Computer and Information Sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006